//	ID : pallab81
// 	PROG : 674
// 	LANG : C++
// 	2011-07-23-22.00.47 Saturday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>

using namespace std;

#define fo(i,ed) for(int i = 0 ; i < ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

int w[] = { 1,5,10,25,50 };
Int cando[ 30100 ];
inline void doit(){
    SET(cando,0);
    cando[0]=1LL;
    int i,j;
    for(i=0;i<5;++i){
        for(j=0; j<=30000; ++j ){
            cando[j+w[i]]+= cando[ j ];
        }
    }
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in.c","rt",stdin);
    #endif
    doit();
    int n;
    while( scanf("%d",&n)==1 ){
        Int ways = cando[n];
        printf("%lld\n",ways);
    }


return 0;
}


